Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
141	Lecture 5: Introduction to Complexity TheoryComplexity Theory Add to Reading List Source URL: www.cs.rice.edu Language: English - Date: 2014-10-16 13:22:26 Applied mathematics P EXPTIME EXPSPACE L FO 2-EXPTIME Theoretical computer science Computational complexity theory Complexity classes
142	On Elementary Linear Logic and polynomial time (Extended Abstract) Patrick Baillot∗ ENS Lyon, Universit´e de Lyon, LIP (UMR 5668 CNRS-ENSL-INRIA-UCBL) Add to Reading List Source URL: www.cs.swan.ac.uk Language: English - Date: 2015-05-05 07:12:16 Complexity classes Proof theory Structural complexity theory Curry–Howard correspondence Type theory NP Time complexity Reduction Linear logic Theoretical computer science Computational complexity theory Applied mathematics
143	CS 170 Algorithms Spring 2009 Add to Reading List Source URL: www-inst.eecs.berkeley.edu Language: English - Date: 2009-05-04 23:56:17 Complexity classes NP-complete problems Boolean algebra Electronic design automation Formal methods Boolean satisfiability problem Conjunctive normal form NP-complete Canonical form Theoretical computer science Mathematics Applied mathematics
144	BRICS Basic Research in Computer Science BRICS RSHansen et al.: Circuits on Cylinders Circuits on Cylinders Add to Reading List Source URL: www.brics.dk Language: English - Date: 2003-01-09 10:18:59 Complexity classes Circuit complexity NC ACC0 Circuit AC Binary decision diagram TC0 FO Theoretical computer science Computational complexity theory Applied mathematics
145	UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 12 Due on May 13 at 3:30 p.m. Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 NP-complete problems Complexity classes Mathematical optimization NP-complete P versus NP problem NP Time complexity Vertex cover Hamiltonian path Theoretical computer science Computational complexity theory Applied mathematics
146	Introduction Subtrees as contexts Let statistics decide Add to Reading List Source URL: wwwling.arts.kuleuven.be Language: English - Date: 2011-05-17 04:07:54 Phrase Syntax NP Koala Eucalypt Mammals of Australia Linguistics Complexity classes
147	Mathematical Programming manuscript No. (will be inserted by the editor) Sanjeev Arora ? Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2007-02-04 13:37:22 NP-complete problems Complexity classes Approximation algorithms Spanning tree Travelling salesman problem Polynomial-time approximation scheme Time complexity Optimization problem Algorithm Theoretical computer science Computational complexity theory Applied mathematics
148	S NP #NP V #V NP #NP #SNP D #D N #N #NPD 0 t h i s #DD 1 t h a t #DN 0 g i r l #NN 1 b o y #N (700) Add to Reading List Source URL: www.cognitionresearch.org Language: English - Date: 2013-01-23 09:43:39 Washington State Judicial elections Mathematical optimization 2nd National Assembly of the Philippines Complexity classes NP Politics of the Philippines
149	Shibuya et al. Algorithms for Molecular Biology 2010, 5:7 http://www.almob.org/contentRESEARCH Open Access Add to Reading List Source URL: www.almob.org Language: English Protein methods Bioinformatics Complexity classes Computational complexity theory Root-mean-square deviation Mathematical optimization Structural alignment Time complexity NP-complete Theoretical computer science Applied mathematics Statistics
150	UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 23 May 1, 2003 Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 NP-complete problems Complexity classes Bin packing problem NP Subset sum problem Partition problem Vertex cover Integer 3-partition problem Theoretical computer science Mathematics Computational complexity theory

UPDATE